Deriving a Strongly Normalizing STG Machine

Deriving a Strong Normalizing STG Machine

We present a modified version of the spineless tagless graph machine (or STG machine for short), that can deal with free variables and makes it possible to use compiled code for the normalization of functional expressions. We derive the machine from a high level semantics, thus enabling a simple correctness proof. Our modified STG machine has been successfully implemented in the Ulysses system.

On a Strongly Normalizing STG Machine with an Application to Dependent Type Checking

From natural semantics to C: A formal derivation of two STG machines

The Spineless Tag-less G-machine (STG machine) was defined as the target abstract machine for compiling the lazy functional language Haskell. It is at the heart of the Glasgow Haskell Compiler (GHC) which is claimed to be the Haskell compiler that generates the most efficient code. A high-level description of the STG machine can be found at (Peyton Jones, 1992; Marlow & Peyton Jones, 2004; Marl...

Using Strictness Information in the STG{machine

The paper presents an attempt at exploiting strictness information for parallel evaluation of functional programs. A simple evaluation model, which uses strictness in a limited way, is suggested. It has been applied in a parallel version of the STG{machine; special attention has been paid to avoiding the creation of useless tasks. Some results from the simulation of the parallel STG{machine are...

A novel framework for solving the state assignment problem for event-based specifications

We propose a novel framework to solve the state assignment problem arising from the signal transition graph (STG) representation of an asynchronous circuit. We first establish a relation between STGs and finite state machines (FSMs). Then we solve the STG state assignment problem by minimizing the number of states in the corresponding FSM and by using a critical race-free state assignment techn...